Resolving Stanley's conjecture on $k$-fold acyclic complexes

نویسندگان

چکیده

In 1993 Stanley showed that if a simplicial complex is acyclic over some field, then its face poset can be decomposed into disjoint rank \(1\) boolean intervals whose minimal faces together form subcomplex. further conjectured complexes with higher notion of acyclicity could in similar way using rank. We provide an explicit counterexample to this conjecture. also prove version the conjecture for trees and show original holds when as high possible.Mathematics Subject Classifications: 05E45, 55U10

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

n-fold Commutative Hyper K-ideals

 In this paper, we aresupposed to introduce the definitions of n-fold commutative, andimplicative hyper K-ideals. These definitions are thegeneralizations of the definitions of commutative, andimplicative hyper K-ideals, respectively, which have been definedin [12]. Then we obtain some related results. In particular wedetermine the relationships between n-fold implicative hyperK-ideal and n-fol...

متن کامل

Fold and Mycielskian on homomorphism complexes

Homomorphism complexes were introduced by Lovász to study topological obstructions to graph colorings. We show that folding in the second parameter of the homomorphism complex yields a homotopy equivalence. We study how the Mycielski construction changes the homotopy type of the homomorphism complex. We construct graphs showing that the topological bound obtained by odd cycles can be arbitraril...

متن کامل

Graphs of Acyclic Cubical Complexes

It is well known that chordal graphs are exactly the graphs of acyclic simplicial complexes . In this note we consider the analogous class of graphs associated with acyclic cubical complexes . These graphs can be characterized among median graphs by forbidden convex subgraphs . They possess a number of properties (in analogy to chordal graphs) not shared by all median graphs . In particular , w...

متن کامل

On Frank's conjecture on k-connected orientations

We disprove a conjecture of Frank [4] stating that each weakly 2k-connected graph has a k-vertex-connected orientation. For k ≥ 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete.

متن کامل

On the representatives k-fold coloring polytope

A k-fold x-coloring of a graph G is an assignment of (at least) k distinct colors from the set {1, 2, . . . , x} to each vertex such that any two adjacent vertices are assigned disjoint sets of colors. The k-th chromatic number of G, denoted by χk(G), is the smallest x such that G admits a k-fold x-coloring. We present an ILP formulation to determine χk(G) and study the facial structure of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorial theory

سال: 2021

ISSN: ['2766-1334']

DOI: https://doi.org/10.5070/c61055379